Cognitive Bare Bones Particle Swarm Optimisation with Jumps
نویسندگان
چکیده
منابع مشابه
Cognitive Bare Bones Particle Swarm Optimisation with Jumps
The ‘bare bones’ (BB) formulation of particle swarm optimisation (PSO) was originally advanced as a model of PSO dynamics. The idea was to model the forces between particles with sampling from a probability distribution in the hope of understanding swarm behaviour with a conceptually simpler particle update rule. ‘Bare bones with jumps’ (BBJ) proposes three significant extensions to the BB algo...
متن کاملBare Bones Particle Swarms with Jumps
Bare Bones PSO was proposed by Kennedy as a model of PSO dynamics. Dependence on velocity is replaced by sampling from a Gaussian distribution. Although Kennedy’s original formulation is not competitive to standard PSO, the addition of a component-wise jumping mechanism, and a tuning of the standard deviation, can produce a comparable optimisation algorithm. This algorithm, Bare Bones with Jump...
متن کاملMulti swarm bare bones particle swarm optimization with distribution adaption
Bare bones PSO is a simple swarm optimization approach that uses a probability distribution like Gaussian distribution in the position update rules. However, due to its nature, Bare bones PSO is highly prone to premature convergence and stagnation. The characteristics of the probability distribution functions used in the update rule have a tense impact on the performance of the bare bones PSO. ...
متن کاملConcept of Velocity into Bare Bones Particle Swarm Optimization Algorithm
Studies have shown that the limit on the updating formula of velocity in particle swarm optimization (PSO) can produce good performance. Inspired by the logic, we introduce the concept of velocity into bare bones particle swarm optimization (BBPSO), which doesn’t consider the velocity term, hence no constraint on velocity. The velocity term is an additional restriction, and thus it doesn’t dama...
متن کاملA Modified Algorithm of Bare Bones Particle Swarm Optimization
Bare bones particle swarm optimization (PSO) greatly simplifies the particles swarm by stripping away the velocity rule, but performance seems not good as canonical one in some test problems. Some studies try to replace the sampling distribution to improve the performance, but there are some problems in the algorithm itself. This paper proposes a modified algorithm to solve these problems. In a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Swarm Intelligence Research
سال: 2016
ISSN: 1947-9263,1947-9271
DOI: 10.4018/ijsir.2016010101